Testing and Securing Web Applications by Das Ravi; Johnson Greg; & Greg Johnson

Author:Das, Ravi; Johnson, Greg; & Greg Johnson
Language: eng
Format: epub
Publisher: Auerbach Publishers, Incorporated
Published: 2020-06-27T00:00:00+00:00

A number of key mathematical algorithms serve as the crux for asymmetric cryptography, and of course, use widely differing mathematical algorithms than the ones used with symmetric cryptography. The algorithms used in asymmetric cryptography are as follows:

The RSA algorithm

The Diffie-Hellman algorithm

The elliptical wave theory algorithm

In terms of the RSA Algorithm, this is probably the most famous and widely used asymmetric cryptography algorithm. In fact, this very algorithm will serve as the foundation for the discussion on biocryptography later in this chapter. The RSA algorithm originates from the RSA Data Security Corporation, and is named after the inventors who created it: Ron Rivest, Adi Shamir, and Leonard Adelman.

The RSA algorithm uses the power of prime numbers to create both the public key and the private key. But using such large keys to encrypt such large amounts of data is totally infeasible from the standpoint of processing power and central server resources. Instead, ironically, the encryption is done using symmetric algorithms (such as the ones reviewed previously), then the private key is further encrypted by the receiving party's public key.

Once the receiving party obtains their ciphertext from the sending party, the private key generated by the symmetric cryptography algorithm is decrypted, and then the public key that was generated by asymmetric cryptography can be subsequently used to decrypt the rest of the ciphertext.

In terms of the Diffie-Hellman asymmetric algorithm, it is named after its inventors as well: Whit Diffie and Martin Hellman. It is also known as the DH algorithm. But interestingly enough, this algorithm is not used for the encryption of the ciphertext; rather, the main concern is to address the problem of finding a solution of the issue of sending a key over a secure channel.

Here is a summary of how it works on a very simple level:

The receiving party, as usual, has the public key and the private key that they have generated, but this time, they both are created by the DH algorithm.

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.